runtime.bmap.tophash (field)

97 uses

	runtime (current package)
		map.go#L155: 	tophash [bucketCnt]uint8
		map.go#L205: 	h := b.tophash[0]
		map.go#L435: 			if b.tophash[i] != top {
		map.go#L436: 				if b.tophash[i] == emptyRest {
		map.go#L496: 			if b.tophash[i] != top {
		map.go#L497: 				if b.tophash[i] == emptyRest {
		map.go#L540: 			if b.tophash[i] != top {
		map.go#L541: 				if b.tophash[i] == emptyRest {
		map.go#L622: 			if b.tophash[i] != top {
		map.go#L623: 				if isEmpty(b.tophash[i]) && inserti == nil {
		map.go#L624: 					inserti = &b.tophash[i]
		map.go#L628: 				if b.tophash[i] == emptyRest {
		map.go#L666: 		inserti = &newb.tophash[0]
		map.go#L735: 			if b.tophash[i] != top {
		map.go#L736: 				if b.tophash[i] == emptyRest {
		map.go#L763: 			b.tophash[i] = emptyOne
		map.go#L769: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map.go#L773: 				if b.tophash[i+1] != emptyRest {
		map.go#L778: 				b.tophash[i] = emptyRest
		map.go#L791: 				if b.tophash[i] != emptyOne {
		map.go#L916: 		if isEmpty(b.tophash[offi]) || b.tophash[offi] == evacuatedEmpty {
		map.go#L949: 				if checkBucket>>(it.B-1) != uintptr(b.tophash[offi]&1) {
		map.go#L954: 		if (b.tophash[offi] != evacuatedX && b.tophash[offi] != evacuatedY) ||
		map.go#L1017: 					b.tophash[i] = emptyRest
		map.go#L1196: 				top := b.tophash[i]
		map.go#L1198: 					b.tophash[i] = evacuatedEmpty
		map.go#L1238: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY
		map.go#L1247: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map.go#L1462: 		if isEmpty(src.tophash[i]) {
		map.go#L1467: 			if isEmpty(dst.tophash[pos]) {
		map.go#L1482: 		dst.tophash[pos] = src.tophash[i]
		map.go#L1571: 				if isEmpty(srcBmap.tophash[i]) {
		map.go#L1641: 			if isEmpty(b.tophash[offi]) {
		map.go#L1704: 			if isEmpty(b.tophash[offi]) {
		map_fast32.go#L45: 			if *(*uint32)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast32.go#L85: 			if *(*uint32)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast32.go#L127: 			if isEmpty(b.tophash[i]) {
		map_fast32.go#L132: 				if b.tophash[i] == emptyRest {
		map_fast32.go#L166: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast32.go#L217: 			if isEmpty(b.tophash[i]) {
		map_fast32.go#L222: 				if b.tophash[i] == emptyRest {
		map_fast32.go#L256: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast32.go#L299: 			if key != *(*uint32)(k) || isEmpty(b.tophash[i]) {
		map_fast32.go#L316: 			b.tophash[i] = emptyOne
		map_fast32.go#L320: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_fast32.go#L324: 				if b.tophash[i+1] != emptyRest {
		map_fast32.go#L329: 				b.tophash[i] = emptyRest
		map_fast32.go#L342: 				if b.tophash[i] != emptyOne {
		map_fast32.go#L401: 				top := b.tophash[i]
		map_fast32.go#L403: 					b.tophash[i] = evacuatedEmpty
		map_fast32.go#L419: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_fast32.go#L428: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast64.go#L45: 			if *(*uint64)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast64.go#L85: 			if *(*uint64)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast64.go#L127: 			if isEmpty(b.tophash[i]) {
		map_fast64.go#L132: 				if b.tophash[i] == emptyRest {
		map_fast64.go#L166: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast64.go#L217: 			if isEmpty(b.tophash[i]) {
		map_fast64.go#L222: 				if b.tophash[i] == emptyRest {
		map_fast64.go#L256: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast64.go#L299: 			if key != *(*uint64)(k) || isEmpty(b.tophash[i]) {
		map_fast64.go#L318: 			b.tophash[i] = emptyOne
		map_fast64.go#L322: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_fast64.go#L326: 				if b.tophash[i+1] != emptyRest {
		map_fast64.go#L331: 				b.tophash[i] = emptyRest
		map_fast64.go#L344: 				if b.tophash[i] != emptyOne {
		map_fast64.go#L403: 				top := b.tophash[i]
		map_fast64.go#L405: 					b.tophash[i] = evacuatedEmpty
		map_fast64.go#L421: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_fast64.go#L430: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_faststr.go#L32: 				if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L33: 					if b.tophash[i] == emptyRest {
		map_faststr.go#L48: 			if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L49: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L97: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L127: 				if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L128: 					if b.tophash[i] == emptyRest {
		map_faststr.go#L143: 			if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L144: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L192: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L239: 			if b.tophash[i] != top {
		map_faststr.go#L240: 				if isEmpty(b.tophash[i]) && insertb == nil {
		map_faststr.go#L244: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L285: 	insertb.tophash[inserti&(bucketCnt-1)] = top // mask inserti to avoid bounds checks
		map_faststr.go#L330: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L344: 			b.tophash[i] = emptyOne
		map_faststr.go#L348: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_faststr.go#L352: 				if b.tophash[i+1] != emptyRest {
		map_faststr.go#L357: 				b.tophash[i] = emptyRest
		map_faststr.go#L370: 				if b.tophash[i] != emptyOne {
		map_faststr.go#L429: 				top := b.tophash[i]
		map_faststr.go#L431: 					b.tophash[i] = evacuatedEmpty
		map_faststr.go#L447: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_faststr.go#L456: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check